Meijer G–Functions: A Gentle Introduction

نویسندگان

  • Richard Beals
  • Jacek Szmigielski
چکیده

T he Meijer G–functions are a remarkable family G of functions of one variable, each of them determined by finitely many indices. Although each such function is a linear combination of certain special functions of standard type, they seem not to be well known in the mathematical community generally. Indeed they are not even mentioned in most books on special functions, e.g., [1], [18]. Even the new comprehensive treatise [15] devotes a scant 2 of its 900+ pages to them. (The situation is different in some of the literature oriented more toward applications, e.g., the extensive coverage in [6] and [9].) The present authors were ignorant of all but the name of the G–functions until the second author found them relevant to his research [3]. As we became acquainted with them, we became convinced that they deserved a wider audience. Some reasons for this conviction are the following: • The G–functions play a crucial role in a certain useful mathematical enterprise. • When looked at conceptually, they are both natural and attractive. • Most special functions, and many products of special functions, are G–functions or are expressible as products of G–functions with elementary functions. There are seventy-five such formulas in [4, sec. 5.6]; see also [6, sec. 6.2], [9, chap. 2], and [20]. Examples are the exponential function, Bessel functions, and products of Bessel functions (the notation will be explained below):

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak Theories of Arithmetic for Computational Complexity: A Gentle Introduction

In this talk we will discuss about proof-theoretic approaches to computational complexity in terms of weak theories of arithmetic as known as theories of bounded arithmetic, which was initiated by Samuel Buss. We will start with classical facts on primitive recursive functions, and then go into discussion about polynomial time functions and polynomial space functions, including a recent challen...

متن کامل

A Gentle Introduction to Grassmannians

We introduce the Grassmannian G(k, V ) as a set, and via the tools of multilinear algebra, the Plücker embedding and the Plücker coordinates on G(k, V ). We also prove some basic theorems about the Grassmannians and attempt to familiarize the reader with some of the fundamental ideas and language needed to work with the Grassmannian and its subvarieties.

متن کامل

RoCoCo - An R Package Implementing a Robust Rank Correlation Coefficient and a Corresponding Test

This document is a user manual for the R package rococo. It is only meant as a gentle introduction into how to use the basic functions implemented in this package. Not all features of the R package are described in full detail. Such details can be obtained from the documentation enclosed in the R package. Further note the following: (1) this is not an introduction to robust rank correlation; (2...

متن کامل

fastseg An R Package for fast segmentation

This document is a user manual for the R package fastseg. It is only meant as a gentle introduction into how to use the basic functions implemented in this package. Not all features of the R package are described in full detail. Such details can be obtained from the documentation enclosed in the R package. Further note the following: (1) this is neither an introduction to segmentation algorithm...

متن کامل

A Gentle Introduction to Yao’s Garbled Circuits

This is a short, gentle introduction to the Yao’s Garbled Circuits construction and recent optimizations, as well as the garbled circuit definitions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013